Chaotic Quantum Genetic Algorithm and Its Application
نویسندگان
چکیده
In order to enhance the global and local search ability of genetic algorithm (GA) in solution space, an improved GA is introduced in this paper. First, the chaotic initialization is introduced into GA to improve its global search performance. Furthermore, improved quantum crossover is introduced to exchange information between different chromosomes, this action is useful for improving local search ability of GA. The performance of the proposed algorithm is evaluated by simulating a number of traveling salesman problems(TSP). Simulation results show that the proposed algorithm can avoid the premature convergence and has superior ability of searching the global optimal or near-optimum solutions.
منابع مشابه
Non-linear Fractional-Order Chaotic Systems Identification with Approximated Fractional-Order Derivative based on a Hybrid Particle Swarm Optimization-Genetic Algorithm Method
Although many mathematicians have searched on the fractional calculus since many years ago, but its application in engineering, especially in modeling and control, does not have many antecedents. Since there are much freedom in choosing the order of differentiator and integrator in fractional calculus, it is possible to model the physical systems accurately. This paper deals with time-domain id...
متن کاملAn Optimized PID for Capsubots using Modified Chaotic Genetic Algorithm (RESEARCH NOTE)
This paper proposes a design for a mesoscale capsule robot which can be used in gaining diagnostic data and delivering medical treatment in inaccessible parts of the human body. A novel approach is presented for the capsule robot control: A PID-controlled closed-loop approach. A modified chaotic genetic algorithm will be used to optimize the coefficients of PID controller. Then, simulation will...
متن کاملData Clustring Using A New CGA(Chaotic-Generic Algorithm) Approach
Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...
متن کاملChaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملChaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks
Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011